package search.graph;

import java.util.Comparator;

/**
 * Vergleicht die zurueckgelegten Wege.
 */
class BellmanFordComparator implements Comparator<Path> {
	
	public int compare(Path p1, Path p2) {
        double dist = p1.getLastNode().getBFdistance() - p2.getLastNode().getBFdistance();
        return (dist < 0)? -1: (dist == 0)? 0: +1;  
    }
}
